Abstract Fixpoint Computations with Numerical Acceleration Methods
نویسندگان
چکیده
Fixpoint Computations with Numerical Acceleration Methods Olivier Bouissou and Yassamine Seladji CEA, LIST, Laboratory for the Modeling and Analysis of Interacting Systems 91191 Gif-sur-Yvette, France
منابع مشابه
Acceleration of the abstract fixpoint computation in numerical program analysis
Static analysis by abstract interpretation aims at automatically proving properties of computer programs, by computing invariants that over-approximate the program behaviors. These invariants are defined as the least fixpoint of a system of semantic equations and are most often computed using Kleene iteration. This computation may not terminate so specific solutions were proposed to deal with t...
متن کاملSound Numerical Computations in Abstract Acceleration
Soundness is a major objective for verification tools. Methods that use exact arithmetic or symbolic representations are often prohibitively slow and do not scale past small examples. We propose the use of numerical floating-point computations to improve performance combined with an interval analysis to ensure soundness in reach-set computations for numerical dynamical models. Since the interva...
متن کاملNumerical Abstract Domain using Support Functions (Extended Version)
An abstract interpretation based static analyzer depends on the choice of both an abstract domain and a methodology to compute fixpoints of monotonic functions. Abstract domains are almost always representations of convex sets that must provide efficient algorithms to perform both numerical and order-theoretic computations. In this paper, we present a new abstract domain that uses support funct...
متن کاملLIFL , University of Lille , France and University of Oxford , UK
Acceleration in Linear Relation Analysis (extended version) ha l-0 07 87 21 2, v er si on 1 11 F eb 2 01 3 Gonnord & Schrammel Abstract Acceleration in LRA (extended version) Abstract Linear relation analysis is a classical abstract interpretation based on an over-approximation of reachable numerical states of a program by convex polyhedra. Since it works with a lattice of infinite height, it m...
متن کاملFlat Acceleration in Symbolic Model Checking
Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques” enhance the convergence of fixpoint computations by computing the transitive closure of some transitions. In this paper we develop a new framework for symbolic model checking with accelerations. We also propose and analyze new sym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 267 شماره
صفحات -
تاریخ انتشار 2010